Causal automata
نویسنده
چکیده
We introduce causal automata, a formalism based on a syntactic approach to causality in contrast to conventional approaches based on partial orders. Our main result is the following characterisation of Milner’s notion of confluence in CCS: Confluence ≡ Determinism + {AND,OR} Causality.
منابع مشابه
Causal Automata I: Connuence Fand, Org Causality
In this paper we introduce causal automata, a formalism for reasoning about reactive systems. In contrast to other formalisms in common use, causal automata permit complex causal relationships to be speciied in a straightforward manner while having at the same time a simple and intuitive operational behaviour. Our main result, which follows on from earlier work in 4, 5], uses causal automata to...
متن کاملA Causal Analysis Method for Concurrent Hybrid Automata
Modern artifacts are typically composed of many system components and exhibit a complex pattern of continuous/discrete behaviors. A concurrent hybrid automaton is a powerful modeling concept to capture such a system’s behavior in terms of hybrid automata for the individual system components and the concurrent composition of thereof. Because of the potentially large number of modes of the concur...
متن کاملFuzzy Causal Simulation in Process Engineering
This paper presents a causal simulation method for incompletely known dynamic systems in process engineering . The causal model of a process is represented as both a causal network of interacting elementary dynamic systems, called qualitative automata, influencing one another, and a set of qualitative constraints linking possibly several of such automata . Associated with each influence is a we...
متن کاملCausal Graph Dynamics
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time — but under the natural constraint that information can only ever be transmitted at a bounded speed, with respect to the distance given by the graph. The notion of translation-invariance is also generaliz...
متن کاملCausal Dynamics of Discrete Surfaces
Various generalizations of cellular automata, such as stochastics [5], asynchronous [11] or non-uniform cellular automata [6], have already been studied. In [1, 2, 3, 4] the authors, together with Dowek and Nesme, generalize Cellular Automata theory to arbitrary, time-varying graphs. I.e. they formalize the intuitive idea of a labelled graph which evolves in time, subject to two natural constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 101 شماره
صفحات -
تاریخ انتشار 1992